An effective hybrid tabu search algorithm for multi-objective flexible job-shop scheduling problems
نویسندگان
چکیده
This paper proposes an effective hybrid tabu search algorithm (HTSA) to solve the flexible job-shop scheduling problem. Three minimization objectives – the maximum completion time (makespan), the total workload of machines and the workload of the critical machine are considered simultaneously. In this study, a tabu search (TS) algorithmwith an effective neighborhood structure combining two adaptive rules is developed, which constructs improved local search in the machine assignment module. Then, a well-designed left-shift decoding function is defined to transform a solution to an active schedule. In addition, a variable neighborhood search (VNS) algorithm integrating three insert and swap neighborhood structures based on public critical block theory is presented to perform local search in the operation scheduling component. The proposed HTSA is tested on sets of the well-known benchmark instances. The statistical analysis of performance comparisons shows that the proposed HTSA is superior to four existing algorithms including the AL + CGA algorithm by Kacem, Hammadi, and Borne (2002b), the PSO + SA algorithm by Xia and Wu (2005), the PSO + TS algorithm by Zhang, Shao, Li, and Gao (2009), and the Xing’s algorithm by Xing, Chen, and Yang (2009a) in terms of both solution quality and efficiency. 2010 Elsevier Ltd. All rights reserved.
منابع مشابه
An effective hybrid particle swarm optimization algorithm for multi-objective flexible job-shop scheduling problem
0360-8352/$ see front matter 2008 Elsevier Ltd. A doi:10.1016/j.cie.2008.07.021 * Corresponding author. E-mail address: [email protected] (X. Shao). Flexible job-shop scheduling problem (FJSP) is an extension of the classical job-shop scheduling problem. Although the traditional optimization algorithms could obtain preferable results in solving the monoobjective FJSP. However, they are very d...
متن کاملAn Improved Tabu Search Algorithm for Job Shop Scheduling Problem Trough Hybrid Solution Representations
Job shop scheduling problem (JSP) is an attractive field for researchers and production managers since it is a famous problem in many industries and a complex problem for researchers. Due to NP-hardness property of this problem, many meta-heuristics are developed to solve it. Solution representation (solution seed) is an important element for any meta-heuristic algorithm. Therefore, many resear...
متن کاملA Hybrid Multi Objective Algorithm for Flexible Job Shop Scheduling
Scheduling for the flexible job shop is very important in both fields of production management and combinatorial optimization. However, it quit difficult to achieve an optimal solution to this problem with traditional optimization approaches owing to the high computational complexity. The combining of several optimization criteria induces additional complexity and new problems. In this paper, a...
متن کاملSolving Flexible Job Shop Scheduling with Multi Objective Approach
In this paper flexible job-shop scheduling problem (FJSP) is studied in the case of optimizing different contradictory objectives consisting of: (1) minimizing makespan, (2) minimizing total workload, and (3) minimizing workload of the most loaded machine. As the problem belongs to the class of NP-Hard problems, a new hybrid genetic algorithm is proposed to obtain a large set of Pareto-optima...
متن کاملSolving the flexible job shop problem by hybrid metaheuristics-based multiagent model
The flexible job shop scheduling problem (FJSP) is a generalization of the classical job shop scheduling problem that allows to process operations on one machine out of a set of alternative machines. The FJSP is an NP-hard problem consisting of two sub-problems, which are the assignment and the scheduling problems. In this paper, we propose how to solve the FJSP by hybrid metaheuristics-based c...
متن کاملA New Multi-objective Job Shop Scheduling with Setup Times Using a Hybrid Genetic Algorithm
This paper presents a new multi objective job shop scheduling with sequence-dependent setup times. The objectives are to minimize the makespan and sum of the earliness and tardiness of jobs in a time window. A mixed integer programming model is developed for the given problem that belongs to NP-hard class. In this case, traditional approaches cannot reach to an optimal solution in a reasonable...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computers & Industrial Engineering
دوره 59 شماره
صفحات -
تاریخ انتشار 2010